Spectrum of weighted Birkhoff average
نویسندگان
چکیده
Let $\{s_n\}_{n\in \mathbb N}$ be a decreasing nonsummable sequence of positive reals. We investigate the weighted Birkhoff average $\frac {1}{S_n}\sum _{k=0}^{n-1}s_k\phi (T^kx)$ on an aperiodic irreducible subshift $\Sigma _{\bf A}$ finite type where
منابع مشابه
Distributed Cooperative Spectrum Sensing Using Weighted Average Consensus
In this paper, we study the distributed spectrum sensing in cognitive radio networks. Existing distributed consensus-based fusion algorithms only ensure equal gain combining of local measurements, whose performance may be incomparable to various centralized soft combining schemes. Motivated by this fact, we consider practical channel conditions and link failures, and develop new weighted soft m...
متن کاملOptimistic Fuzzy Weighted Average
− The fuzzy weighted average (FWA) is used in many engineering problems where aggregation of fuzzy information is dealt with. In this framework, many algorithms have been proposed to compute efficiently the FWA according to Zadeh's extension principle. However, due to fuzzy interval calculus, the exact solution presents a characteristic that may be viewed as an important drawback. Indeed, repla...
متن کاملFuzzy Weighted Average - Analytical Solution
An algorithm is presented for the computation of analytical expressions for the extremal values of the α-cuts of the fuzzy weighted average, for triangular or trapeizoidal weights and attributes. Also, an algorithm for the computation of the inverses of these expressions is given, providing exact membership functions of the fuzzy weighted average. Up to now, only algorithms exist for the comput...
متن کاملAverage distance in weighted graphs
Let G be a given connected graph on n vertices. Suppose N facilities are located in the vertices of the graph. We consider the expected distance between two randomly chosen facilities. This is modelled by the following definition: Let G be a connected graph and let each vertex have weight c(v). The average distance of G with respect to c is defined as µ c (G) = N 2 −1 {u,v}⊆V (G) d G (u, v), wh...
متن کاملThe Weighted‐Average Lagged Ensemble
A lagged ensemble is an ensemble of forecasts from the same model initialized at different times but verifying at the same time. The skill of a lagged ensemble mean can be improved by assigning weights to different forecasts in such a way as to maximize skill. If the forecasts are bias corrected, then an unbiased weighted lagged ensemble requires the weights to sum to one. Such a scheme is call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2023
ISSN: ['0039-3223', '1730-6337']
DOI: https://doi.org/10.4064/sm210908-19-6